Two-dimensional patterns with distinct differences: constructions, bounds, and maximal anticodes
نویسندگان
چکیده
A two-dimensional grid with dots is called a configuration with distinct differences if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many applications such as radar, sonar, physical alignment, and time-position synchronization. Rather than restricting dots to lie in a square or rectangle, as previously studied, we restrict the maximum distance between dots of the configuration; the motivation for this is a new application of such configurations to key distribution in wireless sensor networks. We consider configurations in the hexagonal grid as well as in the traditional square grid, with distances measured both in the Euclidean metric, and in the Manhattan or hexagonal metrics. We note that these configurations are confined inside maximal anticodes in the corresponding grid. We classify maximal anticodes for each diameter in each grid. We present upper bounds on the number of dots in a pattern with distinct differences contained in these maximal anticodes. Our bounds settle (in the negative) a question of Golomb and Taylor on the existence of honeycomb arrays of arbitrarily large size. We present constructions and lower bounds on the number of dots in configurations with distinct differences contained in various two-dimensional shapes (such as anticodes) by considering periodic configurations with distinct differences in the square grid.
منابع مشابه
The Impact of Different Frequency Patterns on the Syntactic Production of a 6-year-old EFL Home Learner: A Case Study
This longitudinal study investigated the impact of different Frequency Patterns (FP) on the syntactic production of a six-year-old EFL learner in a home context. Target syntactic constructions were presented using games and plays and were traced for their occurrence patterns in input and output. Following each instruction period, the constructions were measured through immediate and delayed ora...
متن کاملOptimal tristance anticodes in certain graphs
For z1, z2, z3 ∈ Z, the tristance d3(z1, z2, z3) is a generalization of the L1-distance on Z to a quantity that reflects the relative dispersion of three points rather than two. A tristance anticode Ad of diameter d is a subset of Z with the property that d3(z1, z2, z3) 6 d for all z1, z2, z3 ∈ Ad. An anticode is optimal if it has the largest possible cardinality for its diameter d. We determin...
متن کاملThe Diametric Theorem in Hamming Spaces-Optimal Anticodes
Ž n . For a Hamming space X , d , the set of n-length words over the alphabet a H 4 n X s 0, 1, . . . , a y 1 endowed with the distance d , which for two words x s a H Ž . n Ž . n x , . . . , x , y s y , . . . , y g X counts the number of different components, 1 n 1 n a we determine the maximal cardinality of subsets with a prescribed diameter d or, in another language, anticodes with distance ...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملThe Multi-Dimensional Frobenius Problem
Consider the problem of determining maximal vectors g such that the Diophantine system Mx = g has no solution. We provide a variety of results to this end: conditions for the existence of g, conditions for the uniqueness of g, bounds on g, determining g explicitly in several important special cases, constructions for g, and a reduction for M .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 56 شماره
صفحات -
تاریخ انتشار 2010